Compositional Methods for Probabilistic Systems

نویسندگان

  • Luca de Alfaro
  • Thomas A. Henzinger
  • Ranjit Jhala
چکیده

We present a compositional trace based model for proba bilistic systems The behavior of a system with probabilistic choice is a stochastic process namely a probability distribution on traces or bun dle Consequently the semantics of a systemwith both nondeterministic and probabilistic choice is a set of bundles The bundles of a composite system can be obtained by combining the bundles of the components in a simple mathematical way Re nement between systems is bundle containment We achieve assume guarantee compositionality for bundle semantics by introducing two scoping mechanisms The rst mechanism which is standard in compositional modeling distinguishes inputs from outputs and hidden state The second mechanism which arises in prob abilistic systems partitions the state into probabilistically independent

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compositional probabilistic verification through multi-objective model checking

Compositional approaches to verification offer a powerful means to address the challenge of scalability. In this paper, we develop techniques for compositional verification of probabilistic systems based on the assume-guarantee paradigm. We target systems that exhibit both nondeterministic and stochastic behaviour, modelled as probabilistic automata, and augment these models with costs or rewar...

متن کامل

Compositional bisimulation metric reasoning with Probabilistic Process Calculi

We study which standard operators of probabilistic process calculi allow for compositional reasoning with respect to bisimulation metric semantics. We argue that uniform continuity (generalizing the earlier proposed property of non-expansiveness) captures the essential nature of compositional reasoning and allows now also to reason compositionally about recursive processes. We characterize the ...

متن کامل

On learning assumptions for compositional verification of probabilistic systems

Probabilistic model checking is a powerful formal verification method that can ensure the correctness of real-life systems that exhibit stochastic behaviour. The work presented in this thesis aims to solve the scalability challenge of probabilistic model checking, by developing, for the first time, fully-automated compositional verification techniques for probabilistic systems. The contribution...

متن کامل

Learning-Based Compositional Verification for Synchronous Probabilistic Systems

We present novel techniques for automated compositional verification of synchronous probabilistic systems. First, we give an assume-guarantee framework for verifying probabilistic safety properties of systems modelled as discretetime Markov chains. Assumptions about system components are represented as probabilistic finite automata (PFAs) and the relationship between components and assumptions ...

متن کامل

Compositional Testing Preorders for Probabilistic Processes

Transition systems are well-established as a semantic model for distributed systems. There are widely accepted preorders that serve as criteria for reenement of a more abstract transition system to a more concrete one. To reason about probabilistic phenomena such as failure rates, we need to extend models and methods that have proven successful for non-probabilistic systems to a probabilistic s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001